An Infinitary Graded Modal Logic (Graded Modalities VI)
نویسندگان
چکیده
We prove a completeness theorem for K:l, the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic. Mathematics Subject Classification: 03B45, 03’275.
منابع مشابه
The Modality of Finite (Graded Modalties VII)
We prove a completeness theorem for Kr, an extension of K by the operator Or that means “there exists a finite number of accessible worlds such that . . . is true”, plus suitable axioms to rule it. This i s done by an application of the method of consistency properties for modal systems as in [4] with suitable adaptations. Despite no graded modality is invoked here, we consider this work as per...
متن کاملThe Complexity of the Graded µ-Calculus
In classical logic, existential and universal quantifiers express that there exists at least one individual satisfying a formula, or that all individuals satisfy a formula. In many logics, these quantifiers have been generalized to express that, for a non-negative integer , at least individuals or all but individuals satisfy a formula. In modal logics, graded modalities generalize standard exis...
متن کاملMax-planck-institut F Ur Informatik Translating Graded Modalities into Predicate Logic Publication Notes
In the logic of graded modalities it is possible to talk about sets of nite cardinality. Various calculi exist for graded modal logics and all generate vast amounts of case distinctions. In this paper we present an optimized translation from graded modal logic into many-sorted predicate logic. This translation has the advantage that in contrast to known approaches our calculus enables us to rea...
متن کاملModel Checking for Graded CTL
Recently, complexity issues related to the decidability of the μ-calculus, when the universal and existential quantifiers are augmented with graded modalities, have been investigated by Kupfermann, Sattler and Vardi ([19]). Graded modalities refer to the use of the universal and existential quantifiers with the added capability to express the concept of at least k or all but k, for a non-negati...
متن کاملCTLModel-Checking with Graded Quantifiers
The use of the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a nonnegative integer k, has been thoroughly studied in various kinds of logics. In classical logic there are counting quantifiers, in modal logics graded modalities, in description logics number restrictions. Recently, the complexity issues related to the decidability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 41 شماره
صفحات -
تاریخ انتشار 1995